Sardinas-Patterson like algorithms in coding theory

نویسنده

  • Bogdan Paşaniuc
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Sardinas-Patterson Characterization Theorem for SE-codes

The aim of this paper is to present a Sardinas-Patterson like characterization theorem for SE-codes. The relationship between this result and the similar one for classical codes is also discussed.

متن کامل

Characterization Results for Time-Varying Codes

Time-varying codes associate variable length code words to letters being encoded depending on their positions in the input string. These codes have been introduced in [8] as a proper extension of L-codes. This paper is devoted to a further study of time-varying codes. First, we show that adaptive Huffman encodings are special cases of encodings by time-varying codes. Then, we focus on three kin...

متن کامل

Fuzzy Clustering Approach Using Data Fusion Theory and its Application To Automatic Isolated Word Recognition

 In this paper, utilization of clustering algorithms for data fusion in decision level is proposed. The results of automatic isolated word recognition, which are derived from speech spectrograph and Linear Predictive Coding (LPC) analysis, are combined with each other by using fuzzy clustering algorithms, especially fuzzy k-means and fuzzy vector quantization. Experimental results show that the...

متن کامل

On Unique Decodability, McMillan’s Theorem and the Expected Length of Codes

In this paper we propose a revisitation of the topic of unique decodability and of some of the related fundamental theorems. It is widely believed that, for any discrete source X, every “uniquely decodable” block code satisfies E[l(X1, X2, · · · , Xn)] ≥ H(X1, X2, . . . , Xn), where X1, X2, . . . , Xn are the first n symbols of the source, E[l(X1, X2, · · · , Xn)] is the expected length of the ...

متن کامل

Uniform asymptotics of some Abel sums arising in coding theory

We derive uniform asymptotic expressions of some Abel sums appearing in some problems in coding theory and indicate the usefulness of these sums in other fields, like empirical processes, machine maintenance, analysis of algorithms, probabilistic number theory, queuing models, etc.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003